Fast Mutual Exclusion Algorithms Using Read-Modify-Write and Atomic Read/Write Registers
نویسنده
چکیده
Three fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented in a sequence, with an improvement from one to the next. The last algorithm is shown to be optimal in minimizing the number of remote memory accesses required in a resource busy period. Remote memory access is the key factor of memory access bottleneck in large shared-memory multiprocessors. The algorithm is particularly suitable in such systems for applications with small critical sections and frequent resource requests.
منابع مشابه
A Tight Bound on Time Complexity of Mutual Exclusion
In distributed shared memory multiprocessors, remote memory accesses generate processor-tomemory traffic which may result in a bottleneck. It is therefore important to design algorithms that minimize the number of remote memory accesses. We establish a lower bound of 3 on remote access time complexity for mutual exclusion algorithms in a model where processes communicate by means of a general r...
متن کاملWeak Read/Write Registers
In [14], Lamport has defined three classes of shared registers which support read and write operations, called —safe, regular and atomic—depending on their properties when several reads and/or writes are executed concurrently. We consider generalizations of Lamport’s notions, called k-safe, k-regular and k-atomic. First, we provide constructions for implementing 1-atomic registers (the stronges...
متن کاملComputing with Infinitely Many Processes
We explore four classic problems in concurrent computing (election, mutual exclusion, consensus, and naming) when the number of processes which may participate is infinite. Partial information about the number of actually participating processes and the concurrency level is shown to affect the possibility and complexity of solving these problems. We survey and generalize work carried out in mod...
متن کاملBeyond Atomic Registers: Bounded Wait-Free Implementations of Nontrivial Objects
We de ne a class of operations called pseudo read-modify-write (PRMW) operations, and show that nontrivial shared data objects with such operations can be implemented in a bounded, wait-free manner from atomic registers. A PRMW operation is similar to a \true" read-modify-write (RMW) operation in that it modi es the value of a shared variable based upon the original value of that variable. Howe...
متن کاملAtomic Read-Modify-Write Operations are Unnecessary for Shared-Memory Work Stealing
We present a work-stealing algorithm for total-store memory architectures, such as Intel’s X86, that does not rely on atomic readmodify-write instructions such as compare-and-swap. In our algorithm, processors communicate solely by reading from and writing (non-atomically) into weakly consistent memory. We also show that join resolution, an important problem in scheduling parallel programs, can...
متن کامل